Minimum Cost Matching in a Random Graph with Random Costs
نویسندگان
چکیده
منابع مشابه
Minimum Cost Matching in a Random Graph with Random Costs
Let Gn,p be the standard Erdős-Rényi-Gilbert random graph and let Gn,n,p be the random bipartite graph on n + n vertices, where each e ∈ [n] appears as an edge independently with probability p. For a graph G = (V,E), suppose that each edge e ∈ E is given an independent uniform exponential rate one cost. Let C(G) denote the random variable equal to the length of the minimum cost perfect matching...
متن کاملMinimum-cost matching in a random bipartite graph with random costs
Let G = Gn,n,p be the random bipartite graph on n+n vertices, where each e ∈ [n] appears as an edge independently with probability p. Suppose that each edge e is given an independent uniform exponential rate one cost. Let C(G) denote the expected length of the minimum cost perfect matching. We show that w.h.p. if d = np (log n) then E [C(G)] = (1 + o(1)) 2 6p . This generalises the well-known r...
متن کاملMinimum-cost matching in a regular bipartite graph with random costs
Let G be an arbitrary d-regular bipartite graph on 2N vertices. Suppose that each edge e is given an independent uniform exponential rate one cost. Let C(G) denote the expected length of the minimum cost perfect matching. We show that if d = d(N) → ∞ as N → ∞, then E [C(G)] = (1 + o(1))Nd π 6 . This generalises the well-known result for the case G = KN,N .
متن کاملA Fuzzy Random Minimum Cost Network Flow Programming Problem
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
متن کاملThe minimum size of a maximal strong matching in a random graph
Let be the random graph with fixed p 1. A strong matching S in Gn,p is a set of {el, e2, ... I em} such that no other of the connects an end-vertex of with an end-vertex of ej, ei ej. We show in this paper, that there exist positive constants Cl and C2 such that, with probability tending to 1 as n --+ 00, the minimum size of a maximal strong in Gn,p lies between 1/21ogdn c1logd1ogdn and logdn +...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2017
ISSN: 0895-4801,1095-7146
DOI: 10.1137/15m1047672